An adaptive fast direct solver for boundary integral equations in two dimensions
نویسندگان
چکیده
Article history: Received 16 August 2010 Revised 20 January 2011 Accepted 23 January 2011 Available online 28 January 2011 Communicated by Leslie F. Greengard
منابع مشابه
An adaptive fast direct solver for boundary integral equations in two dimensions
discretization of boundary integral equations of potential theory in two dimensions. The algorithm is combined with a scheme that adaptively rearranges the parameterization of the boundary in order to minimize the ranks of the off-diagonal blocks in the discretized operator, thus obviating the need for the user to supply a parameterization r of the boundary for which the distance llr(s) -r(t)ll...
متن کاملA fast direct solver for boundary integral equations in two dimensions
We describe an algorithm for the direct solution of systems of linear algebraic equations associated with the discretization of boundary integral equations with non-oscillatory kernels in two dimensions. The algorithm is ‘‘fast’’ in the sense that its asymptotic complexity is O(n), where n is the number of nodes in the discretization. Unlike previous fast techniques based on iterative solvers, ...
متن کاملA Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization | SIAM Journal on Scientific Computing | Vol. 34, No. 5 | Society for Industrial and Applied Mathematics
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the original matrix into a larger but highly structured sparse one that allows fast factorization and application of the inverse. The algorithm extends the Martinsso...
متن کاملA Fast Direct Solver for Structured Linear Systems by Recursive Skeletonization
We present a fast direct solver for structured linear systems based on multilevel matrix compression. Using the recently developed interpolative decomposition of a low-rank matrix in a recursive manner, we embed an approximation of the original matrix into a larger but highly structured sparse one that allows fast factorization and application of the inverse. The algorithm extends the Martinsso...
متن کاملA Tensor-Train accelerated solver for integral equations in complex geometries
We present a framework using the Quantized Tensor Train (QTT) decomposition to accurately and efficiently solve volume and boundary integral equations in three dimensions. We describe how the QTT decomposition can be used as a hierarchical compression and inversion scheme for matrices arising from the discretization of integral equations. For a broad range of problems, computational and storage...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011